Computational complexity of weighted splitting schemes on parallel computers

In models of complicated physical-chemical processes operator splitting is very often applied in order to achieve sufficient accuracy as well as efficiency of the numerical solution. The recently rediscovered weighted splitting schemes have the great advantage of being parallelizable on operator level, which allows us to reduce the computational time if parallel computers are used. In this paper the computational times needed for the weighted splitting methods are studied in comparison with the sequential splitting and the Marchuk-Strang splitting and are illustrated by numerical experiments performed by use of simplified versions of the Danish Eulerian Model.